Implementing a Modal Logic over Data and Processes using XTL

نویسندگان

  • Jeremy Bryans
  • Carron Shankland
چکیده

The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying properties involving both data and transitions. In this paper we present a restricted prototype implementation of a model checker for LOTOS for queries written using the FULL logic. The model checker is developed within the CADP package using XTL.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Suhrawardi's Modal Syllogisms

Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...

متن کامل

XTL: An XML Transformation Language and XSLT generator for XTL

This paper describes a new query and transformation language XTL (An XML transformation language). XTL is based on both output driven and schema driven approach: 1) To specify an output structure of transformation using XML schema language (so far we choose DTD), 2) To map from well-formed input XML documents to an output structure using XPath that is embedded in DTD. XTL has a simple syntax, a...

متن کامل

Advanced Modelling and Verification Techniques Applied to a Cluster File System

This paper describes the application of advanced formal modelling techniques and tools from the CADP toolset to the verification of CFS, a distributed file system kernel. After a short overview of the specification of CFS, we describe the techniques used for model generation and verification, and their application to CFS. Two original aspects are put forth: firstly, the model is generated in a ...

متن کامل

Model Checking FO(R) over One-Counter Processes and beyond

One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products of one-counter processes against 1) first-order logic FO(R) with reachability predicate, 2) the finite variable fragments FO(R) (k ≥ 2) of FO(R), 3) EF-logic which is a fragment of FO(R), and 4) all these logics extended with si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001